Robust Ensemble Manifold Projective Non-Negative Matrix Factorization for Image Representation
نویسندگان
چکیده
منابع مشابه
Position-Aware Non-negative Matrix Factorization for Satellite Image Representation
Satellite images clustering is a challenging problem in remote sensing and machine vision, where each image content is represented by a high-dimensional feature vector. However, the feature vectors might not be appropriate to express the semantic content of images, which eventually leads to poor results in clustering and classification. To tackle this problem, we propose a novel approach to gen...
متن کاملRobust non-negative matrix factorization
Non-negative matrix factorization (NMF) is a recently popularized technique for learning partsbased, linear representations of non-negative data. The traditional NMF is optimized under the Gaussian noise or Poisson noise assumption, and hence not suitable if the data are grossly corrupted. To improve the robustness of NMF, a novel algorithm named robust nonnegative matrix factorization (RNMF) i...
متن کاملConvergent Projective Non-negative Matrix Factorization
In order to solve the problem of algorithm convergence in projective non-negative matrix factorization (P-NMF), a method, called convergent projective non-negative matrix factorization (CP-NMF), is proposed. In CP-NMF, an objective function of Frobenius norm is defined. The Taylor series expansion and the Newton iteration formula of solving root are used. An iterative algorithm for basis matrix...
متن کاملDiscriminant Projective Non-Negative Matrix Factorization
Projective non-negative matrix factorization (PNMF) projects high-dimensional non-negative examples X onto a lower-dimensional subspace spanned by a non-negative basis W and considers W(T) X as their coefficients, i.e., X≈WW(T) X. Since PNMF learns the natural parts-based representation Wof X, it has been widely used in many fields such as pattern recognition and computer vision. However, PNMF ...
متن کاملRobust hierarchical image representation using non-negative matrix factorization with sparse code shrinkage preprocessing
When analyzing patterns, our goals are (i) to find structure in the presence of noise, (ii) to decompose the observed structure into sub-components, and (iii) to use the components for pattern completion. Here, a novel loop architecture is introduced to perform these tasks in an unsupervised manner. The architecture combines sparse code shrinkage with non-negative matrix factorization and blend...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3038383